Parallel algorithms for rational cones and affine monoids

نویسنده

  • Christof Söger
چکیده

Acknowledgements First of all I would like to thank my advisor Winfried Bruns for his inspiring guidance and support. Our discussions have been very helpful, and I am always enjoying to work with him. I also wish to thank all my colleagues at the Institute for Mathematics. They are providing a very pleasant working atmosphere. Many thanks also to Merle for listening to my incomprehensible discourses and her standby in various ways. Moreover, I thank all of my friends for offering me advice and distraction, especially Jochen for thought-provoking discussions on algorithms and parallelization. Special thanks to my family. They provided excellent frame conditions for my whole undergraduate and doctoral studies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Normaliz: Algorithms for affine monoids and rational cones

Normaliz is a program for the computation of Hilbert bases of rational cones and the normalizations of affine monoids. It may also be used for solving diophantine linear systems. In this paper we present the algorithms implemented in the program.

متن کامل

Recent Developments in Normaliz

The software Normaliz implements algorithms for rational cones and affine monoids. In this note we present recent developments. They include the support for (unbounded) polyhedra and semi-open cones. Furthermore, we report on improved algorithms and parallelization, which allow us to compute significantly larger examples.

متن کامل

The Search for Equivariant Vector Bundles Using Computer Algebra in Algebraic Geometry and Group Theory Normaliz: Algorithms for Rational Cones and Affine Monoids Michael Adam: the Cohen-lenstra Heuristic and the Distribution of Eigenspaces in Classical Groups

15:30 – 16:00 Julia Bartsch (Universität Göttingen): Algorithmic Aspects of Branch Groups 16:15 – 16:45 Simon Keicher (Universität Tübingen): Computing Cox rings 17:15 – 17:45 Armin Shalile (Universität Stuttgart): Decomposition numbers of Brauer algebras via Jucys-Murphy elements 18:00 – 18:30 Grischa Studzinski (RWTH Aachen): Development, implementation and applications of fundamental algorit...

متن کامل

Introduction to Normaliz 2.5

In this paper we introduce the version 2.5 of Normaliz , a program for the computation of Hilbert bases of rational cones and the normalizations of affine monoids. It may also be used for solving diophantine linear systems of inequalities, equations and congruences. We present some of the new features of the program, as well as some recent achievements.

متن کامل

Intermediate Sums on Polyhedra Ii:bidegree and Poisson Formula

We continue our study of intermediate sums over polyhedra, interpolating between integrals and discrete sums, which were introduced by A. Barvinok [Computing the Ehrhart quasipolynomial of a rational simplex, Math. Comp. 75 (2006), 1449– 1466]. By well-known decompositions, it is sufficient to consider the case of affine cones s+c, where s is an arbitrary real vertex and c is a rational polyhed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014